Fast Kernel Smoothing in R with Applications to Projection Pursuit

نویسندگان

چکیده

This paper introduces the R package FKSUM, which offers fast and exact evaluation of univariate kernel smoothers. The main computations are implemented in C++, wrapped simple, intuitive versatile functions. based on recursive expressions involving order statistics, allows for smoothers at all sample points log-linear time. In addition to general purpose smoothing functions, built readyto-use implementations popular kernel-type estimators. On top these basic problems, this focuses projection pursuit problems index is estimators functionals projected density.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Projection Pursuit via Decomposition of Bias Termsof Kernel Density

Dimension reduction of data, < d ! < p (p << d), to be used for clustering has speciic requirements that are not generally met by generic dimension reduction algorithms such as principal components. Projection pursuit, on the other hand, has a growing variety of criteria that target holes, skewness, etc., using information measures, density functionals, sample moments, etc. With the exception o...

متن کامل

Combining Exploratory Projection Pursuit and Projection Pursuit Regression with Application to Neural Networks

Parameter estimation becomes difficult in high-dimensional spaces due to the increasing sparseness of the data. Therefore, when a low-dimensional representation is embedded in the data, dimensionality reduction methods become useful. One such method-projection pursuit regression (Friedman and Stuetzle 1981 (PPR)-is capable of performing dimensionality reduction by composition, namely, it constr...

متن کامل

Optimizing Kernel Function with Applications to Kernel Principal Analysis and Locality Preserving Projection for Feature Extraction

Kernel learning is a popular research topic in pattern recognition and machine learning. Kernel selection is a crucial problem endured by kernel learning method in the practical applications. Many methods of finding the optimal parameters have been presented, but this kind of methods have no ability of changing the kernel structure, accordingly without changing the data distribution in kernel m...

متن کامل

Fast Projection Pursuit Based on Quality of Projected Clusters

Projection pursuit index measuring quality of projected clusters (QPC) introduced recently optimizes projection directions by minimizing leave-one-out error searching for pure localized clusters. QPC index has been used in constructive neural networks to discover non-local clusters in high-dimensional multiclass data, reduce dimensionality, aggregate features, visualize and classify data. Howev...

متن کامل

A Fast Approach to the Detection of All-Purpose Hubs in Complex Networks with Chemical Applications

A novel algorithm for the fast detection of hubs in chemical networks is presented. The algorithm identifies a set of nodes in the network as most significant, aimed to be the most effective points of distribution for fast, widespread coverage throughout the system. We show that our hubs have in general greater closeness centrality and betweenness centrality than vertices with maximal degree, w...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Statistical Software

سال: 2022

ISSN: ['1548-7660']

DOI: https://doi.org/10.18637/jss.v101.i03